Relative neighborhood graphs in three dimensions
نویسندگان
چکیده
منابع مشابه
Relative Neighborhood Graphs and Their Relatives
This is a survey of results on neighborhood graphs The paper discusses properties bounds on the size algorithms and variants of the neighborhood graphs Numerous applications including computational morphology spatial analysis pattern classi cation and data bases for computer vision are described A rich bibliography of the subject concludes the paper keywords computational geometry computational...
متن کاملThree-valued k-neighborhood domination in graphs
Let k~l be an integer, and let G = (V, E) be a graph. The closed kneighborhood N k[V] of a vertex v E V is the set of vertices within distance k from v. A 3-valued function f defined on V of the form f : V --+ { -1,0, I} is a three-valued k-neighborhood dominating function if the sum of its function values over any closed k-neighborhood is at least 1. The weight of a threevalued k-neighborhood ...
متن کاملOn algebraically defined graphs in three dimensions
Let F be a field of characteristic zero or of a positive odd characteristic p. For a polynomial f ∈ F[x, y], we define a graph ΓF(xy, f) to be a bipartite graph with vertex partition P ∪L, P = F = L, and (p1, p2, p3) ∈ P is adjacent to [l1, l2, l3] ∈ L if and only if p2 + l2 = p1l1 and p3 + l3 = f(p1, l1). If f = xy, the graph ΓF(xy, xy ) has the length of a shortest cycle (the girth) equal to ...
متن کاملDrawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a divide and conquer approach. More specifically, it draws each cluster in a 2D plane to minimise occlusion and ease navigation. Then a 3D drawing of the whole graph is constructed by combining these 2D drawings. Our ma...
متن کاملDrawing Graphs Symmetrically in Three Dimensions
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1992
ISSN: 0925-7721
DOI: 10.1016/0925-7721(92)90017-m